منابع مشابه
The Decimation Process in Random k-SAT
Let Φ be a uniformly distributed random k-SAT formula with n variables and m clauses. Non-rigorous statistical mechanics ideas have inspired a message passing algorithm called Belief propagation guided decimation for finding satisfying assignments of Φ. This algorithm can be viewed as an attempt at implementing a certain thought experiment that we call the decimation process. In this paper we i...
متن کاملOn Belief Propagation Guided Decimation for Random k-SAT
Let Φ be a uniformly distributed random k-SAT formula with n variables and m clauses. Non-constructive arguments show that Φ is satisfiable for clause/variable ratios m/n ≤ rk ∼ 2 ln 2 with high probability. Yet no efficient algorithm is know to find a satisfying assignment for densities as low as m/n ∼ rk · ln(k)/k with a non-vanishing probability. In fact, the density m/n ∼ rk · ln(k)/k seems...
متن کاملPerformance of the Survey Propagation-guided decimation algorithm for the random NAE-K-SAT problem
We show that the Survey Propagation guided decimation algorithm fails to find satisfying assignments on random instances of the “Not-All-Equal-K-SAT” problem, well below the satisfiability threshold. Our analysis applies to a broad class of algorithms that may be described as “sequential local algorithms” — such algorithms iteratively set variables based on some local information and/or local r...
متن کاملBalanced K-SAT and Biased random K-SAT on trees
Abstract We study and solve some variations of the random K-satisfiability problem balanced K-SAT and biased random K-SAT on a regular tree, using techniques we have developed earlier [14]. In both these problems, as well as variations of these that we have looked at, we find that the SATUNSAT transition obtained on the Bethe lattice matches the exact threshold for the same model on a random gr...
متن کاملThresholds in Random Graphs and k-sat
In their seminal work [6],[7], Erdos and Renyi invented the notion of random graphs and made the fundamental observation that when the parameter controlling the edge probability varies, the random system undergoes a dramatic and swift qualitative change. “Much like water that freezes abruptly as its temperature drops below zero the structure of the random graph quickly changes from a primordial...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2012
ISSN: 0895-4801,1095-7146
DOI: 10.1137/110842867